翻訳と辞書 Words near each other ・ Shannon Brown ・ Shannon Brown (disambiguation) ・ Shannon Brown (singer) ・ Shannon Byrnes ・ Shannon C. Stimson ・ Shannon Callows ・ Shannon Camper ・ Shannon capacity of a graph ・ Shannon Cave ・ Shannon Cemetery ・ Shannon Chan-Kent ・ Shannon Charles Thomas ・ Shannon City, Iowa ・ Shannon Clavelle ・ Shannon Cochran ・ Shannon coding ・ Shannon Cole ・ Shannon College of Hotel Management ・ Shannon Collis ・ Shannon Conley ・ Shannon Corcoran ・ Shannon County ・ Shannon County, Missouri ・ Shannon Cox ・ Shannon Crawford ・ Shannon Creek ・ Shannon Criteria ・ Shannon Culver ・ Shannon Cunneen ・ Shannon Curfman Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Shannon coding ： ウィキペディア英語版 Shannon coding In the field of data compression, Shannon coding, named after its creator, Claude Shannon, is a lossless data compression technique for constructing a prefix code based on a set of symbols and their probabilities (estimated or measured). It is suboptimal in the sense that it does not achieve the lowest possible expected code word length like Huffman coding, and never better but sometime equal to the Shannon-Fano coding. The method was the first of its type, The technique was used to prove Shannon's noiseless coding theorem in his 1948 article "A Mathematical Theory of Communication",〔"A Mathematical Theory of Communication" http://cm.bell-labs.com/cm/ms/what/shannonday/shannon1948.pdf〕 and is therefore a centerpiece to the information age. This coding method led rise to the field of information theory and without its contribution, the world would not have any of the many successors; for example Shannon-Fano coding, Huffman coding, or arithmetic coding. Much of our day-to-day lives are significantly influenced by digital data and this would not be possible without Shannon coding and its ongoing evolution of its predecessor coding methods. In Shannon coding, the symbols are arranged in order from most probable to least probable, and assigned codewords by taking the first $l\_i\; =\; \backslash left\backslash lceil\; p\_i(x)\; \backslash right\backslash rceil$ digits from the binary expansions of the cumulative probabilities. $\backslash sum\backslash limits\_^\; p\_k(x)$ . Here $\backslash left\backslash lceil\; x\; \backslash right\backslash rceil$ denotes the function which rounds $x$ up to the next integer value. ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Shannon coding」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.